Matrix-based set approximations and reductions in covering decision information systems

نویسندگان

  • Anhui Tan
  • Jinjin Li
  • Yaojin Lin
  • Guoping Lin
چکیده

Article history: Received 21 June 2014 Received in revised form 12 October 2014 Accepted 12 January 2015 Available online 7 February 2015

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

متن کامل

Communication between information systems with covering based rough sets

Communication between information systems is considered as an important issue in granular computing. The concept of homomorphism is an effective mathematical tool to study information exchange between information systems. This paper provides a study on some basic properties of covering information systems and decision systems under homomorphisms. First, we define consistent functions related to...

متن کامل

Multiple attribute group decision making with linguistic variables and complete unknown weight information

Interval type-2 fuzzy sets, each of which is characterized by the footprint of uncertainty, are a very useful means to depict the linguistic information in the process of decision making. In this article, we investigate the group decision making problems in which all the linguistic information provided by the decision makers is expressed as interval type-2 fuzzy decision matrices where each of ...

متن کامل

A Variable Precision Covering-Based Rough Set Model Based on Functions

Classical rough set theory is a technique of granular computing for handling the uncertainty, vagueness, and granularity in information systems. Covering-based rough sets are proposed to generalize this theory for dealing with covering data. By introducing a concept of misclassification rate functions, an extended variable precision covering-based rough set model is proposed in this paper. In a...

متن کامل

Fast approach to knowledge acquisition in covering information systems using matrix operations

Covering rough set theory provides an effective approach to dealing with uncertainty in data analysis. Knowledge acquisition is a main issue in covering rough set theory. However, the original rough set methods are still expensive for this issue in terms of time consumption. To further improvement, we propose fast approaches to knowledge acquisition in covering information systems by employing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2015